Varying-Radius Tunnel-Following NMPC for Robot Manipulators Using Sequential Convex Quadratic Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trajectory-following methods for large-scale degenerate convex quadratic programming

We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nondegerate and degenerate problems, where degeneracy is understood to mean the failure of strict complementarity at a solution. Global convergence and a polynomial bound on the number of iterations required is given. An implementation, CQP, is a...

متن کامل

Designing an adaptive fuzzy control for robot manipulators using PSO

This paper presents designing an optimal adaptive controller for tracking control of robot manipulators based on particle swarm optimization (PSO) algorithm. PSO algorithm has been employed to optimize parameters of the controller and hence to minimize the integral square of errors (ISE) as a performance criteria. In this paper, an improved PSO using logic is proposed to increase the convergenc...

متن کامل

Lifted Convex Quadratic Programming

Symmetry is the essential element of lifted inference that has recently demonstrated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether this holds for optimisation problems in general. Here we show that for a large class of optimisation methods this is actually the case. More precisely, we introdu...

متن کامل

Solving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations

We describe a branch and bound algorithm for the quadratic assignment problem QAP that uses a convex quadratic programming QP relaxation to obtain a bound at each node The QP subproblems are approximately solved using the Frank Wolfe algorithm which in this case requires the solution of a linear assignment problem on each iteration Our branching strategy makes extensive use of dual information ...

متن کامل

An Adaptive Impedance Controller for Robot Manipulators

A desired dynamic behavior of constrained manipulators can be achieved by means of impedance control and various implementations of fixed controllers have been proposed. In this paper, and adaptive implementation is presented as an alternative to reduce the design sensitivity due to manipulator mismatch. The adaptive controller globally achieves the impedance objective for the nonlinear dynamic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2022

ISSN: ['2405-8963', '2405-8971']

DOI: https://doi.org/10.1016/j.ifacol.2022.11.208